Nonlinear algorithms approach to split common solution problems
نویسندگان
چکیده
*Correspondence: [email protected] 2Department of Mathematics, National Kaohsiung Normal University, Kaohsiung, 824, Taiwan Full list of author information is available at the end of the article Abstract In this paper, we introduce some new iterative algorithms for the split common solution problems for equilibrium problems and fixed point problems of nonlinear mappings. Some examples illustrating our results are also given. MSC: 47J25; 47H09; 65K10
منابع مشابه
A heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملSolving Fractional Programming Problems based on Swarm Intelligence
This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to s...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملNonlinear Algorithms for a Common Solution of a System of Variational Inequalities, a Split Equilibrium Problem and Fixed Point Problems
In this paper, we propose an iterative algorithm for finding a common solution of a system of generalized equilibrium problems, a split equilibrium problem and a hierarchical fixed point problem over the common fixed points set of a finite family of nonexpansive mappings in Hilbert spaces. Furthermore, we prove that the proposed iterative method has strong convergence under some mild conditions...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012